Perfect pyramids

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centered pyramids

Quadtree-like pyramids have the advantage of re-suiting in a multiresolution representation where each pyramid node has four unambiguous parents. Such a centered topology guarantees a clearly defined up-projection of labels. This concept has been successfully and extensively used in applications of contour detection, object recognition and segmentation. Unfortunately, the quadtree-like type of ...

متن کامل

Leveraging Pyramids

The Pyramid system associates importance ratings with individual sentences in evaluated summaries. Given that many summarization systems compose their output from source document sentences with limited or no editing, it is often possible to propagate Pyramid ratings back to the source document and tag source sentences with one measure of their suitability to a generic summary. In the case of Py...

متن کامل

Framing pyramids

In 1983, Burt and Adelson introduced the Laplacian pyramid (LP) as a multiresolution representation for images. We study the LP using the frame theory, and this reveals that the usual reconstruction is suboptimal. We show that the LP with orthogonal filters is a tight frame, and thus, the optimal linear reconstruction using the dual frame operator has a simple structure that is symmetric with t...

متن کامل

Combinatorial pyramids

An irregular pyramid consists of a stack of successively reduced graphs. Each smaller graph is deduced from the preceding one by the contraction or the removal of a set of edges. Using a fixed decimation ratio we need approximatelyO(log(image size)) graphs to encode the whole pyramid. A combinatorial map encodes a planar graph thanks to two permutations encoding the edges and their orientation ...

متن کامل

Correspondences between Pre-pyramids, Pyramids and Robinsonian Dissimilarities

We consider cluster structures in a general setting where they do not necessarily contain all singletons of the ground set. Then we provide a direct proof of the bijection between semi-proper robinsonian dissimilarities and indexed pre-pyramids. This result generalizes its analogue proven by Batbedat in the particular case of definite cluster structures. Moreover, the proposed proof shows that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1992

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700030252